\hypertarget{dijkstra__test_8h}{}\section{src/graph\+\_\+algorithms/single\+\_\+source\+\_\+shortest\+\_\+path/dijkstra/dijkstra\+\_\+test.h File Reference}
\label{dijkstra__test_8h}\index{src/graph\+\_\+algorithms/single\+\_\+source\+\_\+shortest\+\_\+path/dijkstra/dijkstra\+\_\+test.\+h@{src/graph\+\_\+algorithms/single\+\_\+source\+\_\+shortest\+\_\+path/dijkstra/dijkstra\+\_\+test.\+h}}
{\ttfamily \#include \char`\"{}src/google\+\_\+test/gtest.\+h\char`\"{}}\\*
{\ttfamily \#include \char`\"{}dijkstra.\+h\char`\"{}}\\*
{\ttfamily \#include \char`\"{}../../basic\+\_\+graph/graph\+\_\+representation/graph/graph.\+h\char`\"{}}\\*
{\ttfamily \#include \char`\"{}../../basic\+\_\+graph/graph\+\_\+representation/graph\+\_\+vertex/vertexp.\+h\char`\"{}}\\*
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \hyperlink{class_dijkstra_test}{Dijkstra\+Test}
\begin{DoxyCompactList}\small\item\em \hyperlink{class_dijkstra_test}{Dijkstra\+Test}\+:测试类，用于为测试提供基础数据 \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespaceanonymous__namespace_02dijkstra__test_8h_03}{anonymous\+\_\+namespace\{dijkstra\+\_\+test.\+h\}}
\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
\hyperlink{dijkstra__test_8h_a0bf1c6d5f2701ca4a8968c88edcc7110}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_dijkstra_test}{Dijkstra\+Test}, test\+\_\+dijkstra)
\begin{DoxyCompactList}\small\item\em \hyperlink{class_dijkstra_test}{Dijkstra\+Test}\+:测试单源最短路径的的dijkstra算法 \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Variables}
\begin{DoxyCompactItemize}
\item 
const int \hyperlink{namespaceanonymous__namespace_02dijkstra__test_8h_03_a2cccdbeba19d23851ebd1edad58701de}{anonymous\+\_\+namespace\{dijkstra\+\_\+test.\+h\}\+::\+D\+I\+J\+K\+\_\+\+N\+U\+M} =10
\end{DoxyCompactItemize}


\subsection{Function Documentation}
\hypertarget{dijkstra__test_8h_a0bf1c6d5f2701ca4a8968c88edcc7110}{}\index{dijkstra\+\_\+test.\+h@{dijkstra\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!dijkstra\+\_\+test.\+h@{dijkstra\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Dijkstra\+Test, test\+\_\+dijkstra)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Dijkstra\+Test}}]{, }
\item[{test\+\_\+dijkstra}]{}
\end{DoxyParamCaption}
)}\label{dijkstra__test_8h_a0bf1c6d5f2701ca4a8968c88edcc7110}


\hyperlink{class_dijkstra_test}{Dijkstra\+Test}\+:测试单源最短路径的的dijkstra算法 

{\ttfamily test\+\_\+dijkstra}\+:测试单源最短路径的的dijkstra算法 

Definition at line 75 of file dijkstra\+\_\+test.\+h.

